A Theoretical Analysis of Scalability of the Parallel Genome Assembly Algorithms

نویسندگان

  • Munib Ahmed
  • Ishfaq Ahmad
  • Samee Ullah Khan
چکیده

A rapid growth of the sequenced genomic data over the last two decades has far exceeded the advancement of both the algorithms and the computing horsepower required to expeditiously process and analyze it. Several algorithms have been devised and implemented to assist the process of genome fragments assembly: one of the most challenging and computationally intensive processes that may take weeks to assemble large size genomes. A few such algorithms have also been parallelized to speed up the process. However, there is a need to analyze such parallel algorithms using the specific metrics of parallel computing to ascertain their scalability and efficiency. The fact that the problem size can vary from a few million units of data to several billions, along with the vast differences in the degree of repetition in data sets, calls for the ability to establish an association between the nature of the problem and the algorithm that best solves it. This paper analyzes the scalability of two most widely used parallel genome assembly algorithms using Isoefficiency (Grama, Gupta & Kumar 1993) metric which will help provide a guideline to determine when and how to choose a particular genome assembly technique based on the nature and the size of the problem being solved. Keyword: Genome Assembly, Isoefficiency, Parallel Computing, Scalability.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid algorithms for Job shop Scheduling Problem with Lot streaming and A Parallel Assembly Stage

In this paper, a Job shop scheduling problem with a parallel assembly stage and Lot Streaming (LS) is considered for the first time in both machining and assembly stages. Lot Streaming technique is a process of splitting jobs into smaller sub-jobs such that successive operations can be overlapped. Hence, to solve job shop scheduling problem with a parallel assembly stage and lot streaming, deci...

متن کامل

New Formulation and Solution in PCB Assembly Systems with Parallel Batch processors

This paper considers the scheduling problem of parallel batch processing machines with non-identical job size and processing time. In this paper, a new mathematical model with ready time and batch size constraints is presented to formulate the problem mathematically, in which simultaneous reduction of the makespan and earliness-tardiness is the objective function. In recent years, the nature-in...

متن کامل

Modelling and solving the job shop scheduling Problem followed by an assembly stage considering maintenance operations and access restrictions to machines

This paper considers job shop scheduling problem followed by an assembly stage and Lot Streaming (LS). It is supposed here that a number of products have been ordered to be produced. Each product is assembled with a set of several parts. The production system includes two stages. The first stage is a job shop to produce parts. Each machine can process only one part at the same time. The second ...

متن کامل

Clustering of Short Read Sequences for de novo Transcriptome Assembly

Given the importance of transcriptome analysis in various biological studies and considering thevast amount of whole transcriptome sequencing data, it seems necessary to develop analgorithm to assemble transcriptome data. In this study we propose an algorithm fortranscriptome assembly in the absence of a reference genome. First, the contiguous sequencesare generated using de Bruijn graph with d...

متن کامل

A multi-objective genetic algorithm (MOGA) for hybrid flow shop scheduling problem with assembly operation

Scheduling for a two-stage production system is one of the most common problems in production management. In this production system, a number of products are produced and each product is assembled from a set of parts. The parts are produced in the first stage that is a fabrication stage and then they are assembled in the second stage that usually is an assembly stage. In this article, the first...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011